package com.tricode.ile.training.task.one.leastcommonmultiple;

import com.tricode.ile.training.task.one.greatestcommondivisor.GreatestCommonDivisor;

public class LeastCommonMultipleCalculator {
	
	/**
	 * @param a is the first element
	 * @param b is the second element
	 * @return the least common multiple from those two elements
	 */
	
	GreatestCommonDivisor commonDivisor = new GreatestCommonDivisor();
	public int functionLCM(int a, int b){
		return a*b/commonDivisor.functionGCD(a,b);
	}

}
